New reachability trees for analyzing unbounded Petri nets with semilinear reachability sets
نویسندگان
چکیده
منابع مشابه
Parameterized Reachability Trees for Algebraic Petri Nets
This paper is concerned with parameterized reachability trees, which have been proposed by M. Lindquist for predicate/transition nets. We discuss the application of this concept to algebraic nets. For this purpose a slight modification of several definitions is necessary due to the different net descriptions, transition rules and theoretical backgrounds. That’s why we present the whole concept ...
متن کاملAnalyzing Reachability for Some Petri Nets With Fast Growing Markings
Using linear algebraic techniques, we analyse the computational complexity of testing reachability in Petri nets for which markings can grow very fast. This leads to two subclasses of Petri nets for which the reachability problem is PSPACE-complete. These subclasses are not contained in any other subclass for which complexity of the reachability problem was known, such as those given in Esparza...
متن کاملEfficient Reachability Graph Representation of Petri Nets With Unbounded Counters
In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possib...
متن کاملReachability Trees for High Level Petri Nets With Marking Variables
Net invariants and reachability tree are used to investigate dynamic properties of Petri Nets. Both concepts have been generalized for different classes of High Level Petri Nets. But the exponential explosion of the reachability set of High Level Petri Nets is a major obstacle encountered in implementing efficiently algorithms to construct the reachability tree. In this paper we define High Lev...
متن کاملCompositional Reachability in Petri Nets
We introduce a divide-and-conquer algorithm for a modified version of the reachability/coverability problem in 1-bounded Petri nets that relies on the compositional algebra of nets with boundaries: we consider the algebraic decomposition of the net of interest as part of the input. We formally prove the correctness of the technique and contrast the performance of our implementation with state-o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science China Information Sciences
سال: 2018
ISSN: 1674-733X,1869-1919
DOI: 10.1007/s11432-017-9446-3